class Solution(object):
    def largestSubarray(self, nums, k):
        n = len(nums)
        max_v = max(nums[: n - k + 1])
        s = nums.index(max_v)
        return nums[s:s + k]
